Polynomial invariants of graphs II
نویسندگان
چکیده
Negami and Kawagoe has already defined a polynomial f(G) associated with each graph G as what discriminates graphs more finely than the polynomial f(G) definedby Negami and the Tutte polynomial. In this paper, we shall show that the polynomial f(G) includes potentially the generating function counting the independent sets and the degree sequence of a graph G, which cannot be recognized from f(G) in general, and discuss on f(T) of trees T with observations by computer experiments.
منابع مشابه
On the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملInvariants of Graphs in Three-Space
By associating a collection of knots and links to a graph in threedimensional space, we obtain computable invariants of the embedding type of the graph. Two types of isotopy are considered: topological and rigid-vertex isotopy. Rigid-vertex graphs are a category mixing topological flexibility with mechanical rigidity. Both categories constitute steps toward models for chemical and biological ne...
متن کاملHomomorphisms and Polynomial Invariants of Graphs
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial invariants associated with graphs, and closely related to the Tutte polynomial. We then obtain applications of these relationships in several areas, including Abelian Groups and Statistical Physics. A new type of unique...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 12 شماره
صفحات -
تاریخ انتشار 1996